On Maximal Chains In Partially Ordered Sets With Compatible (Left, Right)- Group Actions

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Tripled partially ordered sets

In this paper, we introduce tripled partially ordered sets and monotone functions on tripled partiallyordered sets. Some basic properties on these new dened sets are studied and some examples forclarifying are given.

متن کامل

On Partially Ordered Sets Possessing a Unique Order-compatible Topology

1. Introduction. Let A" be a partially ordered set (poset) with respect to a relation ^, and possessing least and greatest elements O and / respectively. Let us call a subset S of A" up-directed (down-directed) if and only if for all xES and y ES there exists zGS such that 3^x, z^y (z^x, z^y). Following McShane [2], we call a subset K of X Dedekind-closed if and only if whenever S is an up-dire...

متن کامل

Linear Inequalities for Enumerating Chains in Partially Ordered Sets

We characterize the linear inequalities satisfied by flag f -vectors of all finite bounded posets. We do the same for semipure posets. In particular, the closed convex cone generated by flag f -vectors of bounded posets of fixed rank is shown to be simplicial, and the closed cone generated by flag f -vectors of semipure posets of fixed rank is shown to be polyhedral. The extreme rays of both of...

متن کامل

Shortcuts, diversions, and maximal chainsin partially ordered sets

An algorithm is described for finding the maximal weight chain between two points in a locally finite partial order under the restriction that all but • (or fewer) successive pairs in the chain belong to a given subset of the partial order relation. Applications of the method in molecular genetics, critical path scheduling, and other fields are discussed. Let P be a set with two locally finite ...

متن کامل

Coloring Ordered Sets to Avoid Monochromatic Maximal Chains

This paper is devoted to settling the following problem on (infinite, partially) ordered sets: Is there always a partition (2-coloring) of an ordered set X so that all nontrivial maximal chains ofX meet both classes (receive both colors)? We show this is true for all countable ordered sets and provide counterexamples of cardinality H3. Variants of the problem are also considered and open proble...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: AL-Rafidain Journal of Computer Sciences and Mathematics

سال: 2013

ISSN: 2311-7990

DOI: 10.33899/csmj.2013.163545